Gaussian Mersenne and Eisenstein Mersenne primes
نویسندگان
چکیده
The Biquadratic Reciprocity Law is used to produce a deterministic primality test for Gaussian Mersenne norms which is analogous to the Lucas–Lehmer test for Mersenne numbers. It is shown that the proposed test could not have been obtained from the Quadratic Reciprocity Law and Proth’s Theorem. Other properties of Gaussian Mersenne norms that contribute to the search for large primes are given. The Cubic Reciprocity Law is used to produce a primality test for Eisenstein Mersenne norms. The search for primes in both families (Gaussian Mersenne and Eisenstein Mersenne norms) was implemented in 2004 and ended in November 2005, when the largest primes, known at the time in each family, were found.
منابع مشابه
Three New Mersenne Primes and a Statistical Theory
If p is prime, Mp = 2P — 1 is called a Mersenne number. If ui = 4 and «<+1 = Mj+i — 2, then M„ is prime if and only if uv-i m 0(mod Mp). This is called the Lucas test (see Lehmer [4]). The primes Mom , M mi, and Mu2W which are now the largest known primes, were discovered by Illiac II at the Digital Computer Laboratory of the University of Illinois. The computing times were 1 hour 23 minutes, 1...
متن کاملSignificance of Even-oddness of a Prime's Penultimate Digit
The beauty of these relationships is that, by inspection alone, one may instantly observe whether or not a prime number is = 1, or = 3 (mod 4). These relationships are especially valuable for very large prime numbers-such as the larger Mersenne primes. Thus, it is seen from inspection of the penultimate digits of the Mersenne primes, as given in [1 ] , that all of the given primes are = 3 (mod ...
متن کاملPrimes in Sequences Associated to Polynomials (after Lehmer)
In a paper of 1933, D.H. Lehmer continued Pierce’s study of integral sequences associated to polynomials, generalizing the Mersenne sequence. He developed divisibility criteria, and suggested that prime apparition in these sequences – or in closely related sequences – would be denser if the polynomials were close to cyclotomic, using a natural measure of closeness. We review briefly some of the...
متن کاملGeneralization of a Theorem of Drobot
It is well known that the Fibonacci number Fn can be a prime only If n 4 or n p, where p is an odd prime. Throughout this paper, p will denote a prime. In a very interesting paper, Drobot [2] proved that Fp is composite for certain primes p. In particular, he proved that if p > 7, p = 2 or 4 (mod 5), and 2p -1 is also a prime, then 2p -11 Fp and Fp > 2p . For example, 371 Fl9 = 4181-37-113. A s...
متن کاملSimple Power Analysis on Fast Modular Reduction with Generalized Mersenne Prime for Elliptic Curve Cryptosystems
We discuss side channel leakage from modular reduction for NIST recommended domain parameters. FIPS 186-2 has 5 recommended prime fields. These primes have a special form which is referred to as generalized Mersenne prime. These special form primes facilitate especially efficient implementation. A typical implementation of efficient modular reduction with such primes includes conditional reduct...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Comput.
دوره 79 شماره
صفحات -
تاریخ انتشار 2010